Deadlock - Free : Fault Tolerant Wormhole Routing in Mesh based Massively Parallel Systems *
نویسندگان
چکیده
In this paper we present a routing scheme which is extremely suited for use in massively parallel systems . The routing algorithm is fault-tolerant so that network failures will not stop the system. For reasons of scalability, the routing information is extremely compact, also when the network is injured . The wormhole routing technique guarantees very low routing latency . Moreover the routing is guaranteed to be deadlock-free without the need for dedicated buffering .
منابع مشابه
Fault-Tolerant Wormhole Routing in Mesh with Overlapped Solid Fault Regions
A fault tolerant wormhole routing algorithm on mesh-connected processors is proposed. The proposed algorithm is based on the solid fault model and allows the fault polygons to be overlapped. The algorithm compares the position of fault region relative to current channel with the fault direction eld of a misrouted message to route around overlapped fault polygons. A node deactivating algorithm t...
متن کاملKIM and HAN : FAULT - TOLERANT ADAPTIVE WORMHOLE ROUTING IN 2 D MESH
A fault-tolerant wormhole routing algorithm on meshconnected processors is proposed. The proposed algorithm is based on the solid fault model and allows the fault polygons to be overlapped. The algorithm compares the position of fault region relative to current channel with the fault direction eld of a misrouted message to route around overlapped fault polygons. A node deactivating algorithm to...
متن کاملHierarchical adaptive routing: a framework for fully adaptive and deadlock-free wormhole routing
Adaptive routing can improve network performance and fault-tolerance by providing multiple routing paths. However, the implementation complexity of adaptive routing can be signiicant, discouraging its use in commercial massively parallel systems. In this paper, we introduce Hierarchical Adaptive Routing (HAR), a new adaptive routing framework, which provides a uni-ed framework for simple and hi...
متن کاملA Compact Fault-tolerant, Deadlock-free, Minimal Routing Algorithm for n-Dimensional Wormhole Switching Based Meshes
To satisfy the ever increasing demand for computational power, massively parallel computers are mandatory. Such machines require a compact routing scheme for scalability as well as an optimal routing algorithm to minimize the communication delay. Combination of both requirements is reported for fault-free regular structures only . Yet in massively parallel machines the probability of failures b...
متن کاملFault-Tolerant Compact Routing Based on Reduced Structural Information in Wormhole-Switching Based Networks
To satisfy the ever increasing demand for computational power massively parallel computers are mandatory . Such machines require ; as well a compact routing scheme for scalability as an optimal routing algorithm to minimise the communication delay . Combination. of both requirements is reported for regular structures . Yet in a massively parallel machine the probability of failures becomes sign...
متن کامل